Minimal diameter double-loop networks: Dense optimal families
نویسندگان
چکیده
منابع مشابه
New dense families of triple loop networks
Multi-loop digraphs are widely studied mainly because of their symmetric properties and their applications to loop networks. A multi-loop digraph G=G(N;s~,...,SA) has set of vertices V-ZN and adjacencies given by v ~ v + si modN, i = 1 ..... A. For every fixed N, an usual extremal problem is to find the minimum value D(N) = min D(N; where D(N;s~ ..... s~) is the diameter of G. A closely related...
متن کاملOptimal routing in double loop networks
In this paper, we study the problem of finding the shortest path in circulant graphs with an arbitrary number of jumps. We provide algorithms specifically tailored for weighted undirected and directed circulant graphs with two jumps which compute the shortest path. Our method only requires O(log N ) arithmetic operations and the total bit complexity is O(log2 N log log N log log log N ), where ...
متن کاملOn the wide diameter of directed double-loop networks
In parallel transmission system, the wide diameter has become an important factor to measure transmission efficiency instead of the diameter. The minimum distance diagram of a directed doubleloop network yields an L-shaped tile, an L-shaped tile can be described by four geometric parameters: a, b, p and q, let m1⁄4a–p, n1⁄4b q, the L-shaped tiles can be classified into 4 types according to the ...
متن کاملAn efficient algorithm to find optimal double loop networks
The problem of finding optimal diameter double loop networks with a fixed number of vertices has been widely studied. In this work, we give an algorithmic solution of the problem by using a geometrical approach. Given a fixed number of vertices n, the general problem is to find "steps" s 1 , s z e ~',, such that the digraph G(n; sl,s2) with set of vertices V = 7 / a n d adjacencies given by i ~...
متن کاملOptimal double-loop networks with non-unit steps∗
A double-loop digraph G(N ; s1, s2) = G(V,E) is defined by V = ZN and E = {(i, i + s1), (i, i + s2)| i ∈ V }, for some fixed steps 1 ≤ s1 < s2 < N with gcd(N, s1, s2) = 1. Let D(N ; s1, s2) be the diameter of G and let us define D(N) = min 1≤s1<s2<N, gcd(N,s1,s2)=1 D(N ; s1, s2), D1(N) = min 1<s<N D(N ; 1, s). Some early works about the diameter of these digraphs studied the minimization of D(N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1991
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230210102